Computation of spatial skyline points

The database skyline query (or non-domination query) has a spatial form: Given set P with n point sites, and S of m locations interest, site p ∈ is if only for each q ∖ { } , there exists at least one location s that closer to than . We reduce the problem determining points finding sites have non-empty cells in an additively weighted Voronoi diagram under convex distance function. weights said are derived from coordinates while function In two-dimensional plane, this reduction gives O ( + ) log ⁡ -time algorithm find points.